Solving Line-feature Stereo Matching with Genetic Algorithms in Hough Space

نویسندگان

  • Fang-Chih Tien
  • Te-Hsiu Sun
چکیده

This paper presents a method that converts the line-matching problem in image space into a simple point-matching problem in Hough space. By means of solving this point-matching problem, the correspondence between lines is derived. In this study, line features are first extracted in image space, and transformed into Hough space as points. Then, a point-feature based stereo matching problem is formulated and further constructed as an energy function for minimization. We propose a hybrid heuristic procedure, which includes the Hough transformation, point feature segmentation, Vector Quantization, and a genetic algorithm, to derive the minimal solutions of the energy function. Two experiments were conducted to verify the proposed method. Experimental results show that the proposed method effectively and efficiently solves the correspondence problem in Hough space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Based on Line Matching in Hough Space Using Dynamic Programming

This paper presents a method of using Hough space for solving the correspondence problem in stereo vision. It is shown that the line-matching problem in image space can readily be converted into a point-matching problem in Hough (p-8) space. Dynamic programming can be used for searching the optimal matching, now in Hough space. The combination of multiple constraints, especially the natural emb...

متن کامل

Real-time Line Detection and Line-based Motion Stereo

Recognition of shape is one of the fundamental problems in computer vision. A number of fast line detection and line-based depth recovery algorithms have been developed on various parallel architectures to meet the requirement of real-time robotic vision. This thesis describes a parallel and hierarchical (pyramidal) approach to fast Hough line detection and line-based motion stereo. The lines a...

متن کامل

Fast Edge-Based Stereo Matching Algorithms through Search Space Reduction

Finding corresponding edges is considered being the most difficult part of edge-based stereo matching algorithms. Usually, correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on epipolar line and maximum disparity. Reduction of search region can increase performances of the matching process, in the context of execution...

متن کامل

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Search Space Reduction in the Edge Based Stereo Correspondence

Usually, the stereo correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on the epipolar line and the maximum disparity. The reduction of the search space can increase the performance of the matching process, in the co text of the execution time and the accuracy. For the edge-based stereo correspondence, we obtain the n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004